Optimized View Frustum Culling Algorithms for Bounding Boxes

نویسندگان

  • Ulf Assarsson
  • Tomas Akenine-Möller
چکیده

This paper presents optimizations for faster view frustum culling (VFC) for axis aligned bounding box (AABB) and oriented bounding box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary bounding volumes, but we only present results for AABBs and OBBs. In particular, we provide solutions which is 2 11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimized View Frustum Culling Algorithms

This paper presents new techniques for fast view frustum culling. View frustum cullers (VFCs) are typically used in virtual reality software, walkthrough algorithms, scene graph APIs or other 3D graphics applications. First we develop a fast basic VFC algorithm. Then we suggest and evaluate four further optimizations, which are independent of each other and works for all kinds of VFC algorithms...

متن کامل

Fast View Frustum Culling of Spatial Object by Analytical Bounding Bin

It is a common sense to apply the VFC (view frustum culling) of spatial object to bounding cube of the object in 3D graphics. The accuracy of VFC can not be guaranteed even in cube rotated three-dimensionally. In this paper is proposed a method which is able to carry out more precise and fast VFC of any spatial object in the image domain of cube by an analytic mapping, and is demonstrated the e...

متن کامل

Conservative From-Point Visibility

Visibility determination has been an important part of the computer graphics research for several decades. First studies of the visibility were hidden line removal algorithms, and later hidden surface removal algorithms. Today’s visibility determination is mainly concentrated on conservative, object level visibility determination techniques. Conservative methods are used to accelerate the rende...

متن کامل

Obscuration Culling on Parallel Graphics Architectures

Obscuration culling makes use of hierarchy information to accelerate rendering of geometric models. Given some sort of object hierarchy composed of bounding volumes it is possible to avoid transforming and rendering the contents of a volume if the volume itself lies outside the view frustum or is completely invisible when rendered against the current z-buffer. Using this idea in conjunction wit...

متن کامل

Walkthrough in Complex Environments at Interactive Rates using Level-of-Detail

One of the biggest problems in computer graphics is displaying huge geometric models at interactive rates. A lot of work has been done to achieve the required frame-rates in architecture, simulation, computer-aided design and entertainment applications. In this paper, a system that enables walkthrough in complex environments using level-of-detail approximations is explained. The system uses hie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Graphics, GPU, & Game Tools

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2000